Formally Specifying and Proving Operational Aspects of Forensic Lucid in Isabelle
نویسندگان
چکیده
A Forensic Lucid intensional programming language has been proposed for intensional cyberforensic analysis. In large part, the language is based on various predecessor and codecessor Lucid dialects bound by the higher-order intensional logic (HOIL) that is behind them. This work formally specifies the operational aspects of the Forensic Lucid language and compiles a theory of its constructs using Isabelle, a proof assistant system.
منابع مشابه
Intensional Cyberforensics
Intensional Cyberforensics Serguei A. Mokhov, Ph.D.Concordia University, 2013 This work focuses on the application of intensional logic to cyberforensic analysis and itsbenefits and difficulties are compared with the finite-state-automata approach. This workextends the use of the intensional programming paradigm to the modeling and implemen-tation of a cyberforensics investigati...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملJavàight Is Type-safe | Deenitely
Java `ight is a large sequential sublanguage of Java. We formalize its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on this formalization, we can express and prove type soundness. All de nitions and proofs have been done formally in the theorem prover Isabelle/HOL. Thus this paper demonstrates that machine-checking the design of non-tr...
متن کاملMechanized Operational Semantics via (co)induction (preliminary Report)
We give a fully automated description of a small programming language in the theorem prover Isabelle-98. The language syntax and semantics are encoded, and we formally verify a range of semantic properties. This is achieved via uniform (co)inductive methods.
متن کاملMachine-Checking the Java Specification: Proving Type-Safety
In this article we present Bali, the formalization of a large (hitherto sequential) sublanguage of Java. We give its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on these deenitions, we can express soundness of the type system, an important design goal claimed to be reached by the designers of Java, and prove that Bali is indeed type-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0904.3789 شماره
صفحات -
تاریخ انتشار 2008